Colored stochastic dominance problems

نویسندگان

  • Jie Xue
  • Yuan Li
چکیده

In this paper, we study the dominance relation under a stochastic setting. Let S be a set of n coloredstochastic points in R, each of which is associated with an existence probability. We investigate theproblem of computing the probability that a realization of S contains inter-color dominances, whichwe call the colored stochastic dominance (CSD) problem. We propose the first algorithm to solve theCSD problem for d “ 2 in Opn log nq time. On the other hand, we prove that, for d ě 3, even theCSD problem with a restricted color pattern is #P-hard. In addition, even if the existence probabilitiesare restricted to be 12, the problem remains #P-hard for d ě 7. A simple FPRAS is then provided toapproximate the desired probability in any dimension. We also study a variant of the CSD problem inwhich the dominance relation is considered with respect to not only the standard basis but any orthogonalbasis of R. Specifically, this variant, which we call the free-basis colored stochastic dominance (FBCSD)problem, considers the probability that a realization of S contains inter-color dominances with respect toany orthogonal basis of R. We show that the CSD problem is polynomial-time reducible to the FBCSDproblem in the same dimension, which proves the #P-hardness of the latter for d ě 3. Conversely, wereduce the FBCSD problem in R to the CSD problem in R, by which an Opn log nq time algorithmfor the former is obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Gene Expression: Dominance, Thresholds and Boundaries

Butterfly color patterns are built as finely tiles mosaics of colored scales, each the product of a single epidermal cell. The overall pattern is composed of a small number of pigments. Each scale appears to make an all-or-none “choice” to synthesize only one of this small set of alternative pigments. Gradual transitions from one color to another on the wing are accomplished by graded changes i...

متن کامل

Electricity Procurement for Large Consumers with Second Order Stochastic Dominance Constraints

This paper presents a decision making approach for mid-term scheduling of large industrial consumers based on the recently introduced class of Stochastic Dominance (SD)- constrained stochastic programming. In this study, the electricity price in the pool as well as the rate of availability (unavailability) of the generating unit (forced outage rate) is considered as uncertain parameters. Th...

متن کامل

Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints

Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into stochastic optimization problems as constraints. In the discrete case, stochastic optimization models involving second order stochastic dominance (SSD) constraints can be solved by linear programming (LP). However, pr...

متن کامل

Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints

We consider a new class of optimization problems involving stochastic dominance constraints of second order. We develop a new splitting approach to these models, optimality conditions and duality theory. These results are used to construct special decomposition methods.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1612.06954  شماره 

صفحات  -

تاریخ انتشار 2016